iSat: Structure Visualization for SAT Problems

نویسندگان

  • Ezequiel Orbe
  • Carlos Areces
  • Gabriel G. Infante López
چکیده

We present iSat, a Python command line tool to analyze and find structure in propositional satisfiability problems. iSat offers an interactive shell to control propositional solvers and generate graph representations of the internal structure of the search space explored by them for visualization, with the final aim of providing a unified environment for propositional solving experimentation. iSat was designed to allow the simple integration of both new provers and new visualization graphs and statistics with a minimum of coding overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evolutionary Local Search Method for Incremental Satisfiability

Incremental satisfiability problem (ISAT) is considered as a generalisation of the Boolean satisfiability problem (SAT). It involves checking whether satisfiability is maintained when new clauses are added to an initial satisfiable set of clauses. Since stochastic local search algorithms have been proved highly efficient for SAT, it is valuable to investigate their application to solve ISAT. Ex...

متن کامل

An algorithm for random signed 3-SAT with intervals

In signed k-SAT problems, one fixes a set M and a set S of subsets of M , and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction of k literals. Each literal is of the form “x ∈ S”, where S ∈ S , and x is one of n variables. For Interval-SAT (iSAT), M is an ordered set and S the set of intervals in M . We propose an algorithm for 3-iSAT, and analyze it on...

متن کامل

Visualizing the Internal Structure of SAT Instances (Preliminary Report)

Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an internal “structure” that hard problem instances do not exhibit. However, little is known about this internal structure. We therefore propose a visualization of the instance’s variable interaction graph (and of its dynami...

متن کامل

Approximate nonlinear model predictive control with in situ adaptive tabulation

In situ adaptive tabulation (ISAT) is applied to store and retrieve solutions of nonlinear model predictive control (NMPC) problems. ISAT controls approximation error by adaptively building the database of NMPC solutions with piecewise linear local approximations. Unlike initial state or constraint parameterized constrained quadratic programming (QP) solutions, ISAT approximates NMPC solutions ...

متن کامل

Direct handling of ordinary differential equations in constraint-solving-based analysis of hybrid systems

We encode the behavior of hybrid discrete-continuous systems, their initial conditions, and the target states in whose reachability we are interested in a bounded model checking (BMC) formula comprising boolean connectives, arithmetic constraints, and ordinary differential equations (ODEs). These Satisfiability (SAT) modulo ODE formulae are the input to our solver, which combines reasoning for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012